Grokking LinkedIn Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
LinkedIn Easy
Find Pivot Index (easy)
Solution: Find Pivot Index
Isomorphic Strings (easy)
Solution: Isomorphic Strings
Second Minimum Node In a Binary Tree (easy)
Solution: Second Minimum Node In a Binary Tree
Minimum Time to Type Word Using Special Typewriter (easy)
Solution: Minimum Time to Type Word Using Special Typewriter
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Can Place Flowers (easy)
Solution: Can Place Flowers
Valid Perfect Square (easy)
Solution: Valid Perfect Square
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Sqrt (easy)
Solution: Sqrt
Valid Palindrome (easy)
Solution: Valid Palindrome
LinkedIn Medium
Rotate List (medium)
Solution: Rotate List
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Valid Triangle Number (medium)
Solution: Valid Triangle Number
Valid Parenthesis String (medium)
Solution: Valid Parenthesis String
Edit Distance (medium)
Solution: Edit Distance
Remove All Ones With Row and Column Flips II (medium)
Solution: Remove All Ones With Row and Column Flips II
Reverse Integer (medium)
Solution: Reverse Integer
Triplet Sum to Zero (medium)
Solution: Triplet Sum to Zero
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Decode Ways (medium)
Solution: Decode Ways
Quadruple Sum to Target (medium)
Solution: Quadruple Sum to Target
Next Permutation (medium)
Solution: Next Permutation
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Word Search (medium)
Solution: Word Search
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
House Robber II (medium)
Solution: House Robber II
Coin Change
Solution: Coin Change
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Merge Intervals (medium)
Solution: Merge Intervals
Number of Islands (easy)
Solution: Number of Islands
Longest Palindromic Subsequence (medium)
Solution: Longest Palindromic Subsequence
Kth Smallest Number (medium)
Solution: Kth Smallest Number
Maximum Product Subarray (medium)
Solution: Maximum Product Subarray
Same Tree (medium)
Solution: Same Tree
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Solution: Merge Intervals

Problem Statement

Given a list of intervals, merge all the overlapping intervals to produce a list that has only mutually exclusive intervals.

Example 1:

Intervals: [[1,4], [2,5], [7,9]]
Output: [[1,5], [7,9]]
Explanation: Since the first two intervals [1,4] and [2,5] overlap, we merged them into one [1,5].
Image

Example 2:

Intervals: [[6,7], [2,4], [5,9]]
Output: [[2,4], [5,9]]
Explanation: Since the intervals [6,7] and [5,9] overlap, we merged them into one [5,9].

Example 3:

Intervals: [[1,4], [2,6], [3,5]]
Output: [[1,6]]
Explanation: Since all the given intervals overlap, we merged them into one.

Constraints:

  • 1 <= intervals.length <= 104
  • intervals[i].length == 2
  • 0 <= starti <= endi <= 104

Solution

Let’s take the example of two intervals (ā€˜a’ and ā€˜b’) such that a.start <= b.start. There are four possible scenarios:

Image

Our goal is to merge the intervals whenever they overlap. For the above-mentioned three overlapping scenarios (2, 3, and 4), this is how we will merge them:

Image

To solve this problem, we will sort the list of intervals by their start times. This helps in easily identifying overlapping intervals. After sorting, we can iterate through the intervals, merging them if they overlap. We will maintain a list to store the merged intervals. As we iterate, we compare the current interval with the last interval in the merged list. If they overlap, we merge them by extending the end time. Otherwise, we add the current interval to the merged list.

This approach works because sorting brings overlapping intervals next to each other. This allows us to handle overlapping intervals in a single pass through the list. Sorting the intervals first is key to simplifying the merging process.

Step-by-Step Algorithm

  1. Sort Intervals:

    • Begin by sorting the list of intervals based on their start times.
    • This can be done using a comparator in Java.
  2. Initialize Merged List:

    • Create an empty list called mergedIntervals to store the merged intervals.
  3. Set Initial Interval:

    • Start by picking the first interval and set it as the current interval.
  4. Iterate Through Intervals:

    • Loop through the rest of the intervals.
    • For each interval:
      • Check Overlap:
        • If the start of the current interval is less than or equal to the end of the previous interval, it means they overlap.
        • In this case, merge them by updating the end of the previous interval to be the maximum of both ends.
      • Non-overlapping:
        • If they do not overlap, add the previous interval to the mergedIntervals list.
        • Update the current interval to be the next interval in the list.
  5. Add Last Interval:

    • After the loop completes, add the last interval to the mergedIntervals list.
  6. Return Result:

    • Return the mergedIntervals list as the final output.

Algorithm Walkthrough

Given input: [[1, 4], [2, 5], [7, 9]]

  1. Sort Intervals:

    • Original intervals: [[1, 4], [2, 5], [7, 9]]
    • Sorted intervals: [[1, 4], [2, 5], [7, 9]] (already sorted)
  2. Initialize Merged List:

    • mergedIntervals: []
  3. Set Initial Interval:

    • Current interval: [1, 4]
  4. Iterate Through Intervals:

    • First Iteration:
      • Next interval: [2, 5]
      • Check overlap: 2 <= 4 (True)
      • Merge intervals: [1, 5]
      • Update current interval: [1, 5]
    • Second Iteration:
      • Next interval: [7, 9]
      • Check overlap: 7 <= 5 (False)
      • Add previous interval to mergedIntervals: [[1, 5]]
      • Update current interval: [7, 9]
  5. Add Last Interval:

    • Add last interval to mergedIntervals: [[1, 5], [7, 9]]
  6. Return Result:

    • mergedIntervals: [[1, 5], [7, 9]]
Image

Code

Here is what our algorithm will look like:

Java
Saved to Cloud

. . . .

Time Complexity

The time complexity of the above algorithm is , where ā€˜N’ is the total number of intervals. We are iterating the intervals only once which will take O(N), in the beginning though, since we need to sort the intervals, our algorithm will take .

Space Complexity

The space complexity of the above algorithm will be O(N) as we need to return a list containing all the merged intervals. We will also need O(N) space for sorting. For Java, depending on its version, Collections.sort() either uses Merge sort or Timsort, and both these algorithms need O(N) space. Overall, our algorithm has a space complexity of O(N).

Similar Problems

Problem 1: Given a set of intervals, find out if any two intervals overlap.

Example:

Intervals: [[1,4], [2,5], [7,9]]
Output: true
Explanation: Intervals [1,4] and [2,5] overlap

Solution: We can follow the same approach as discussed above to find if any two intervals overlap.

Merge Intervals (medium)
Number of Islands (easy)
Mark as Completed

On this page

Problem Statement

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Similar Problems